翻訳と辞書
Words near each other
・ Transovarial transmission
・ Transoxiana
・ Transpac
・ Transpac (cable system)
・ TransPAC2
・ Transpacific (ships)
・ TransPacific Hawaii College
・ Transpacific Industries Group
・ Transpacific Route Case
・ Transpacific Yacht Club
・ Transpacific Yacht Race
・ Transpadane Republic
・ TransPanama Trail
・ Transpantaneira
・ Transparallel mind
Transparallel processing
・ Transparence (album)
・ Transparency
・ Transparency (album)
・ Transparency (behavior)
・ Transparency (data compression)
・ Transparency (film)
・ Transparency (graphic)
・ Transparency (human–computer interaction)
・ Transparency (linguistic)
・ Transparency (market)
・ Transparency (philosophy)
・ Transparency (projection)
・ Transparency (telecommunication)
・ Transparency (trade)


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Transparallel processing : ウィキペディア英語版
Transparallel processing



Transparallel processing is a form of processing, in computing or otherwise, in which items are processed simultaneously by one processor, that is, in one go, as if only one item were concerned.
Transparallel processing complements the three forms of processing called:
* subserial processing, in which items are processed one after the other by many processors;
* serial processing, in which items are processed one after the other by one processor;
* parallel processing, in which items are processed simultaneously by many processors.
Various everyday situations involve some combination of the latter three forms of processing. For instance, at the checkout in a supermarket, the cashiers work in parallel, but each cashier serially processes customer carts that are presented subserially by the customers.
Compared to subserial processing and serial processing, both parallel processing and transparallel processing imply a reduction in the amount of time needed to process all items. Transparallel processing implies, in addition, a reduction in the total amount of work to be done.
For instance, to select the longest pencil from among a number of pencils, the lengths of the pencils could be measured serially by one person, or subserially or in parallel by many persons. The parallel method is faster than the serial and subserial methods, but still involves the same amount of work. The following transparallel method, however, is both time-efficient and work-efficient: One person gathers all pencils in a bundle and places the bundle upright on a table, so that the longest pencil can be selected in a glance.
== Transparallel processing in computers ==

Transparallel processing is the extraordinarily powerful form of processing promised by quantum computers. Furthermore, although a single-processor classical computer cannot perform parallel processing, it can perform transparallel processing. This was found in, and is illustrated by the following example from, structural information theory which is a computational Gestalt theory about visual form perception that models percepts by simplest hierarchical codes (i.e., most compact descriptions) of symbol strings representing candidate interpretations of visual stimuli.
To select a simplest code from among all possible codes of a string, the string is searched for visually relevant regularities such as symmetry and repetition. This search gives rise to numerous strings representing hierarchical levels in possible codes. These strings all are to be searched for regularities too. By nature, however, these strings group into so-called hyperstrings. A hyperstring is a distributed representation of ''O''(2''N'') strings, which is such that the ''O''(2''N'') strings can be searched for regularities as if only one string of length ''N'' were concerned.〔van der Helm, P. A. (2004). (Transparallel processing by hyperstrings. ) ''Proceedings of the National Academy of Sciences USA, 101 (30),'' 10862–10867. (doi:10.1073/pnas.0403402101 ).〕 Hence, the ''O''(2''N'') strings neither have to be searched for regularities in a subserial or serial fashion (i.e., one string after the other) nor in a parallel fashion (i.e., simultaneously by many processors), but they can be searched for regularities in a transparallel fashion (i.e., simultaneously by one processor).
''Hyperstrings.'' Each of the 15 paths from vertex 1 to vertex 9 in this hyperstring represents a string. In graph-theoretical terms, a hyperstring is a simple semi-Hamiltonian directed acyclic graph with the following property: Let π(''v''1,''v''2) be the set of substrings represented by the paths from vertex ''v''1 to vertex ''v''2; then, for all ''i, j, p, q,'' two substring sets π(''i,j'') and π(''p,q'') are either identical or disjunct. Here, for instance, π(1,4) and π(5,8) are identical substring sets containing the substrings ''abc'', ''xc'', and ''ay''. This property enables the 15 strings to be searched for regularities in a transparallel fashion, that is, as if only one string were concerned.



In other words, whereas quantum computers provide a hardware solution to perform transparallel processing (for some computing problems), hyperstrings provide a software solution to perform transparallel processing on single-processor classical computers (for at least one computing problem).

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Transparallel processing」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.